Unified Definition of Heuristics for Classical Planning
نویسنده
چکیده
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general language with disjunctivity and conditional effects first requires an exponential size reduction to STRIPS operators. I present direct formalizations of a number of distance heuristics for a general operator description language in a uniform way, avoiding the exponentiality inherent in earlier reductive approaches. The formalizations use formulae to represent the conditions under which operators have given effects. The exponentiality shows up in satisfiability tests with these formulae, but would appear to be a minor issue because of the small size of the formulae.
منابع مشابه
A Unified View of Cost-Based Heuristics
Many cost-based planning heuristics are based on partial or complete delete relaxation. Definitions of these heuristics are of different nature, which makes it difficult to establish relations and formal comparisons among them. In this paper, we propose a unified definition with enough generality to cover most of existing heuristics. Important relations among heuristics can be derived from our ...
متن کاملProbabilistic Temporal Planning
Planning research has explored the issues that arise when planning with concurrent and durative actions. Separately, planners that can cope with probabilistic effects have also been created. However, few attempts have been made to combine both probabilistic effects and concurrent durative actions into a single planner. The principal one of which we are aware was targeted at a specific domain. W...
متن کاملRelaxation Heuristics for Multiagent Planning
Similarly to classical planning, in MA-STRIPS multiagent planning, heuristics significantly improve efficiency of search-based planners. Heuristics based on solving a relaxation of the original planning problem are intensively studied and well understood. In particular, frequently used is the delete relaxation, where all delete effects of actions are omitted. In this paper, we present a unified...
متن کاملHeuristics and Symmetries in Classical Planning: Additional Proofs
Proof: We only need to show one direction, since the inverse element σ−1 is also a symmetry. Let π = o1 · . . . · ok be a plan for s and let s0, . . . , sk be the sequence of states such that s0 = s and for 1 ≤ i ≤ k, si = si−1JoiK. Let TΠ = 〈S,E〉. Then we have 〈si−1, si; oi〉 ∈ E for all 1 ≤ i ≤ k and therefore, by the definition of symmetries we have 〈σ(si−1), σ(si);σ(oi)〉 ∈ E and C(σ(oi)) = C...
متن کاملEffective Planning with More Expressive Languages
Most of the key computational ideas in classical planning assume a simple planning language where action preconditions and goals are conjunctions of propositional atoms. This is to facilitate the definition and computation of heuristics for guiding the search for plans. In this work, however, we show that this modeling choice hides important structural information, resulting in poorer heuristic...
متن کامل